Linear Variation and Optimized Algorithm of Connected-Component Labeling in Binary Image
نویسندگان
چکیده
Linear variation is a topological characteristic of a function of two variables. The problem of linear variation computing can be reduced to the problem of counting connected components in a binary image with eight-connected connectivity. The proposed method is essentially a modification of some known raster algorithms for connected components labeling that groups pixels into 2× 2 cells. A performance benchmark of the proposed method applied to some approaches on random images is provided.
منابع مشابه
Connected Component Labeling Using Modified Linear Quadtrees
Using the modified linear quadtree proposed in [1,9], this paper presents an O(n·N) algorithm for labeling connected components of a region consisting of N BLACK nodes in a 2n by 2n binary image. As a direct application of the algorithm, a method for computing the perimeter of a region is also described.
متن کاملLinear-time connected-component labeling based on sequential local operations
This paper presents a fast algorithm for labeling connected components in binary images based on sequential local operations. A one-dimensional table, which memorizes label equivalences, is used for uniting equivalent labels successively during the operations in forward and backward raster directions. The proposed algorithm has a desirable characteristic: the execution time is directly proporti...
متن کاملLow-Latency Connected Component Labeling Using an FPGA
Connected component labeling is a process that assigns unique labels to the connected components of a binary image. The main contribution of this paper is to present a low-latency hardware connected component labeling algorithm for k-concave binary images designed and implemented in FPGA. Pixels of a binary image are given to the FPGA in raster order, and the resulting labels are also output in...
متن کاملA linear-time component-labeling algorithm using contour tracing technique
A new linear-time algorithm is presented in this paper that simultaneously labels connected components (to be referred to merely as components in this paper) and their contours in binary images. The main step of this algorithm is to use a contour tracing technique to detect the external contour and possible internal contours of each component, and also to identify and label the interior area of...
متن کاملParallel image component labeling for target acquisition
Jake K. Aggarwal University of Texas at Austin Department of Electrical and Computer Engineering Computer Vision Research Center Austin, Texas 78712-1084 Abstract. An important step in target acquisition is to be able to label various unconnected objects (components) in the scene. We present new algorithms for labeling connected components in a binary image. Eight connectivity for object and ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016